Fix underescaping of queue macros.
authorrobertl <robertl@f51c46e8-681c-474f-0cfe-069cfd0219fb>
Mon, 17 Oct 2005 18:01:22 +0000 (18:01 +0000)
committerrobertl <robertl@f51c46e8-681c-474f-0cfe-069cfd0219fb>
Mon, 17 Oct 2005 18:01:22 +0000 (18:01 +0000)
gpsbabel/nmea.c
gpsbabel/queue.h

index e0f0bc050614b7265e0c48899cedac70db309ce8..9393461b5b0620793f334b80f1582765e91a34a3 100644 (file)
@@ -290,7 +290,7 @@ gpgga_parse(char *ibuf)
                        waypt->fix = fix_dgps;
                        break;
                case 3:
-                       waypt->fix = fix_pps
+                       waypt->fix = fix_pps;
                        break;
        }
 
index e042e235e2de6580847652d86845e35a3a58ce5f..ace6bf431b5f8cd452f526171cba2a4c01ac321d 100644 (file)
@@ -27,11 +27,11 @@ typedef struct queue {
 void enqueue(queue *new_el, queue *old);
 queue * dequeue(queue *element);
 
-#define QUEUE_INIT(head) (head)->next = (head)->prev = head
-#define QUEUE_FIRST(head) (head)->next
-#define QUEUE_NEXT(element) (element)->next
-#define QUEUE_LAST(head) (head)->prev
-#define QUEUE_EMPTY (head)->next == head
+#define QUEUE_INIT(head) (head)->next = ((head)->prev = head)
+#define QUEUE_FIRST(head) ((head)->next)
+#define QUEUE_NEXT(element) ((element)->next)
+#define QUEUE_LAST(head) ((head)->prev)
+#define QUEUE_EMPTY ((head)->next == (head))
 #define QUEUE_MOVE(newhead,oldhead) \
         if ( (oldhead)->next == (oldhead) ) {\
                (newhead)->next = (newhead)->prev = (newhead); \